Deutsch-Jozsa algorithm as a test of quantum computation

A Generalization of the Deutsch-jozsa Quantum Algorithm

A quantum algorithm is presented that can be used to distinguish between certain classes of functions on a finite abelian group. The algorithm is patterned after and generalizes one due to Deutsch and Jozsa for distinguishing a constant function from a balanced function on a direct sum of copies of the integers modulo two. The Deutsch-Jozsa algorithm is a quantum algorithm for distinguishing be...

3 Quantum Guessing via Deutsch - Jozsa

We examine the “Guessing Secrets” problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN3) steps to produce the answer. In showing the possibilities of ...

A different Deutsch-Jozsa

An implementation of the Deutsch-Jozsa algorithm on a three-qubit NMR quantum computer

A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit quantum computer has been investigated using the 400 MHz NMR spectrum of the three coupled protons in 2,3dibromopropanoic acid. It has been employed to impl...

Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits

We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the onequbit Deutsch-Jozsa algorithm we show how the N-qubit version of the Bernstein-Vazirani algorithm can be realized. For the implementation of the three-qubit Deutsch-Jozsa algorithm we study in de...